An Authenticated Key Agreement Protocol Using Isogenies Between Elliptic Curves

A Secure Key Agreement Protocol Using Elliptic Curves

In this paper we propose a secure protocol for authenticated key agreement based on Diffie-Hellman key agreement, which works in an elliptic curve group. We also present a simpler authenticated key agreement protocol than the proposed one and a multiple key agreement protocol which enables the participants to share two or more keys in one execution of the protocol. We prove that our protocols m...

A Secure and E cient Three-Pass Authenticated Key Agreement Protocol Based on Elliptic Curves

Key agreement protocol is of fundamental importance in providing data con dentiality and integrity between two or more parties over an insecure network. In 2004, Popescu [14] proposed an authenticated key agreement protocol in which its security is claimed. However, Yoon and Yoo [19] discovered its vulnerabilities two years later and proposed an improved variant of it. In this paper, we highlig...

A Secure and Efficient Three-Pass Authenticated Key Agreement Protocol Based on Elliptic Curves

Key agreement protocol is of fundamental importance in providing data confidentiality and integrity between two or more parties over an insecure network. In 2004, Popescu [14] proposed an authenticated key agreement protocol in which its security is claimed. However, Yoon and Yoo [19] discovered its vulnerabilities two years later and proposed an improved variant of it. In this paper, we highli...

An Improved Authenticated Multiple-key Agreement Protocol

Elliptic Curve Isogenies-Based Three-party Password Authenticated Key Agreement Scheme towards Quantum-Resistant

Since quantum computers came on the scene, the world has changed greatly, especially related to cryptography. Public key cryptosystem, particularly RSA cryptosystem cant resist the quantum computers attack, so some quantum-resistant schemes have been proposed mainly based on quantum key distribution (QKD) method or new resistance to quantum algorithms. However, to the best of our knowledge, no ...